Counting Solutions of Knapsack Constraints
نویسندگان
چکیده
This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densities of variable-value pairs in knapsack constraints. Given a domain consistent constraint, our first algorithm is inspired from what was proposed for regular language membership constraints. Given a bounds consistent constraint, our second algorithm draws from discrete uniform distributions. Experiments on several problems reveal that simple search heuristics built from the information obtained by these algorithms can be very effective.
منابع مشابه
A Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملA Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy
Given n elements with nonnegative integer weights w = (w1, . . . , wn), an integer capacity C and positive integer ranges u = (u1, . . . , un), we consider the counting version of the classic integer knapsack problem: find the number of distinct multisets whose weights add up to at most C. We give a deterministic algorithm that estimates the number of solutions to within relative error in time ...
متن کاملPolynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs
We give a deterministic, polynomial-time algorithm for approximately counting the number of {0, 1}-solutions to any instance of the knapsack problem. On an instance of length n with total weight W and accuracy parameter ε, our algorithm produces a (1 + ε)-multiplicative approximation in time poly(n, logW, 1/ε). We also give algorithms with identical guarantees for general integer knapsack, the ...
متن کاملApproximate Counting by Dynamic Programming
This proposal describes a project that is going to investigate algorithms for counting knapsack solutions and related sets, with a focus on algorithms that utilise dynamic programming. Both the feasibility of the implementation and the performance characteristics of the algorithms are going to be examined; additional goals pertain to actual algorithmic improvements, with derandomisation being t...
متن کاملCounting and Enumerating Independent Sets with Applications to Knapsack Problems
We introduce methods to count and enumerate all maximal independent, all maximum independent sets, and all independent sets in threshold graphs and k-threshold graphs. Within threshold graphs and k-threshold graphs independent sets correspond to feasible solutions in related knapsack instances. We give several characterizations for knapsack instances and multidimensional knapsack instances whic...
متن کامل